Blow-Up Sequences and Blow-Up Limits

نویسندگان

چکیده

Abstract Let D be an open set in $$\mathbb {R}^d$$ ℝ d and $$u:D\to \mathbb {R}$$ u : D → a (non-negative) local minimizer of $$\mathcal F_\Lambda $$ ℱ Λ

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Testing Graph Blow-Up

Referring to the query complexity of testing graph properties in the adjacency matrix model, we advance the study of the class of properties that can be tested non-adaptively within complexity that is inversely proportional to the proximity parameter. Arguably, this is the lowest meaningful complexity class in this model, and we show that it contains a very natural class of graph properties. Sp...

متن کامل

Homogenization by blow-up

In this paper we highlight how the Fonseca and Müller blow-up technique is particularly well suited for homogenization problems. As examples we give a simple proof of the nonlinear homogenization theorem for integral functionals and we prove a homogenization theorem for sets of finite perimeter.

متن کامل

Blow-Up Lemma

The Regularity Lemma [16] is a powerful tool in Graph Theory and its applications. It basically says that every graph can be well approximated by the union of a constant number of random-looking bipartite graphs called regular pairs (see the definitions below). These bipartite graphs share many local properties with random bipartite graphs, e.g. most degrees are about the same, most pairs of ve...

متن کامل

Shadows of Blow-up Algebras

We study di erent notions of blow-up of a scheme X along a subscheme Y , depending on the datum of an embedding of X into an ambient scheme. The two extremes in this theory are the ordinary blow-up, corresponding to the identity, and the `quasi-symmetric blow-up', corresponding to the embedding of X into a nonsingular variety. We prove that this latter blow-up is intrinsic of Y and X , and is u...

متن کامل

A hypergraph blow-up lemma

Weobtain a hypergraph generalisation of the graph blow-up lemma proved byKomlós, Sarközy and Szemerédi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if they were complete for the purpose of embedding bounded degree hypergraphs. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 39, 275–376, 2011

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture notes of the Unione Matematica Italiana

سال: 2022

ISSN: ['1862-9113', '1862-9121']

DOI: https://doi.org/10.1007/978-3-031-13238-4_6